Comparison of Two Time Series Decomposition Methods: Least Squares and Buys-Ballot Methods
نویسندگان
چکیده
منابع مشابه
Decomposition Methods for Least Squares Parameter Estimation
In this paper least squares method with matrix decomposition is revisited and a multiple model formulation is proposed The proposed formulation takes advantage of the well established decomposition methods but possesses a multiple model structure which leads to simpler and more exible implementations and produces more infor mation than the original least squares methods Several application exam...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولinvestigation of single-user and multi-user detection methods in mc-cdma systems and comparison of their performances
در این پایان نامه به بررسی روش های آشکارسازی در سیستم های mc-cdma می پردازیم. با توجه به ماهیت آشکارسازی در این سیستم ها، تکنیک های آشکارسازی را می توان به دو دسته ی اصلی تقسیم نمود: آشکارسازی سیگنال ارسالی یک کاربر مطلوب بدون در نظر گرفتن اطلاعاتی در مورد سایر کاربران تداخل کننده که از آن ها به عنوان آشکارساز های تک کاربره یاد می شود و همچنین آشکارسازی سیگنال ارسالی همه ی کاربران فعال موجود در...
Total least squares methods
1. the use of weighted norms as a measure of the data perturbation size, capturing prior knowledge about uncertainty in the data; 2. the addition of constraints on the perturbation to preserve the structure of the data matrix, motivated by structured data matrices occurring in signal and image processing, systems and control, and computer algebra; 3. the use of regularization in the problem for...
متن کاملDomain Decomposition Algorithms for First-Order System Least Squares Methods
Least squares methods based on rst-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive de nite discrete systems by using standard nite element spaces, which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these rst-order least squares methods are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Statistics
سال: 2016
ISSN: 2161-718X,2161-7198
DOI: 10.4236/ojs.2016.66091